Elementary proofs of congruences for the cubic and overcubic partition functions

نویسنده

  • James A. Sellers
چکیده

In 2010, Hei-Chi Chan introduced the cubic partition function a(n) in connection with Ramanujan’s cubic continued fraction. Chan proved that ∑ n≥0 a(3n+ 2)q = 3 ∏ i≥1 (1− q3n)3(1− q) (1− qn)4(1− q2n)4 which clearly implies that, for all n ≥ 0, a(3n+ 2) ≡ 0 (mod 3). In the same year, Byungchan Kim introduced the overcubic partition function a(n). Using modular forms, Kim proved that ∑ n≥0 a(3n + 2)q = 6 ∏ i≥1 (1− q3n)6(1− q) (1− qn)8(1− q2n)3 . More recently, Hirschhorn has proven Kim’s generating function result above using elementary generating function methods. Clearly, this generating function result implies that a(3n+ 2) ≡ 0 (mod 6) for all n ≥ 0. In this note, we use elementary means to prove functional equations satisfied by the generating functions for a(n) and a(n), respectively. These lead to new representations of these generating functions as products of terms involving Ramanujan’s ψ and φ functions. In the process, we are able to prove the congruences mentioned above as well as numerous arithmetic properties satisfied by a(n) modulo small powers of 2.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Arithmetic Properties of Overcubic Partition Pairs

Let b(n) denote the number of overcubic partition pairs of n. In this paper, we establish two Ramanujan type congruences and several infinite families of congruences modulo 3 satisfied by b(n). For modulus 5, we obtain one Ramanujan type congruence and two congruence relations for b(n), from which some strange congruences are derived.

متن کامل

Ramanujan’s Elementary Method in Partition Congruences

Page 182 in Ramanujan’s lost notebook corresponds to page 5 of an otherwise lost manuscript of Ramanujan closely related to his paper providing elementary proofs of his partition congruences p(5n + 4) ≡ 0 (mod 5) and p(7n+ 5) ≡ 0 (mod 7). The claims on page 182 are proved and discussed, and further results depending on Ramanujan’s ideas are established.

متن کامل

Ramanujan type identities and congruences for partition pairs

Using elementary methods, we establish several new Ramanujan type identities and congruences for certain pairs of partition functions.

متن کامل

A Simple Proof of Watson's Partition Congruences for Powers of 7

Ramanujan conjectured that if n is of a specific form then/>(«), the number of unrestricted partitions of n, is divisible by a high power of 7. A modified version of Ramanujan's conjecture was proved by G. N. Watson. In this paper we establish appropriate generating formulae, from which Watson's results follow easily. Our proofs are more straightforward than those of Watson. They are elementary...

متن کامل

Parity Results for Certain Partition Functions

Blecksmith, Brillhart and Gerst proved four congruences modulo 2 involving partition generating functions of the following sort. 1 . Y n∈S (1 − q) ≡ 1 + X n≥1 q 2 + X n≥1 q 2 (mod 2) where S = {n > 0 : n ≡ ±(1, 2, 3, 4) or 6 (mod 12)}. We give simple and uniform proofs of their congruences and of several others of the same sort. Each of these congruences yields a theorem on partitions. Thus the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 60  شماره 

صفحات  -

تاریخ انتشار 2014